Compatible Deductive Systems of Pulexes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compatible Deductive Systems of Pulexes

Imai and Iséki [1] introduced the concept of BCK-algebra as a generalization of notions of set difference operation and propositional calculus. The notion of pseudo-BCK algebra was introduced by Georgescu and Iorgulescu [2] as generalization of BCK-algebras not assuming commutativity. Hájek [3] introduced the concept of BL-algebras as the general semantics of basic fuzzy logic (BL-logic). Iorgu...

متن کامل

Deductive Verification of Reactive Systems

Fall 2007: Assignment No. 3 Due Date: 12.21.07 December 10, 2007 The solution to this assignment should be submitted as attachment to an e-mail message. The textual part should be prepared as a postscript, PDF, or Word document. All submitted smv and pf files should be submitted as separate files. You may group all relevant files into a single file, using ZIP or TAR. 1 Peterson(N) Algorithm In ...

متن کامل

Deductive Verification of Modular Systems

EEective veriication methods, both deductive and algorith-mic, exist for the veriication of global system properties. In this paper, we introduce a formal framework for the modular description and verii-cation of parameterized fair transition systems. The framework allows us to apply existing global veriication methods, such as veriication rules and diagrams, in a modular setting. Transition sy...

متن کامل

Grammars, Deductive Systems, and Parsing

Many theories of grammar and styles of grammar speciication have stemmed from mathematical logic, computer science, and computational linguistics, and have been used for describing natural languages. By a series of constructions, we relate categorial, attribute and logic grammars via (axiomatic) labelled deductive systems, and extend this relation to accommodate uniication-based grammars and so...

متن کامل

Minimal Deductive Systems for RDF

This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler language which preserves the original semantics. This approach is beneficial in at least two directions: (a) To have a simple abstract fragment of RDFS easy to formalize and to reason about, which captures the essence of RDFS; (b) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences

سال: 2014

ISSN: 0161-1712,1687-0425

DOI: 10.1155/2014/606890